cAS: The Cunning Ant System
نویسندگان
چکیده
This paper describes the cunning ant system (cAS), which can be used to optimize problems with candidate solutions represented by permutations. cAS generates new candidate solutions from a combination of the pheromone density and the archive of past candidate solutions. Performance of cAS is demonstrated on two important classes of permutation problems: (1) the traveling salesman problem and (2) the quadratic assignment problem. In both problem classes, cAS is shown to perform very well and outperform other techniques for solving these problems. The paper also discusses how the efficiency of cAS can be further improved by combining cAS with local search and by parallelizing cAS using a master-slave architecture. Finally, the paper presents a pheromone-density entropy measure, which can be used to measure the potential of cAS and other ACO algorithms to generate novel, fitter solutions.
منابع مشابه
cAS: Ant Colony Optimization with Cunning Ants
In this paper, we propose a variant of an ACO algorithm called the cunning Ant System (cAS). In cAS, each ant generates a solution by borrowing a part of a solution which was generated in previous iterations, instead of generating the solution entirely from pheromone density. Thus we named it, cunning ant. This cunning action reduces premature stagnation and exhibits good performance in the sea...
متن کاملCunning Ant System: An Extension of Edge Histogram Sampling Algorithms to ACO
In this paper, we propose a variant of an ACO algorithm called the cunning Ant System (cAS). In cAS, each ant generates a solution by borrowing a part of a solution which was generated in previous iterations, instead of generating the solution entirely from pheromone density. Thus we named it, cunning ant. This cunning action reduces premature stagnation and exhibits good performance in the sea...
متن کاملCunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization
The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most promising ACO algorithms. In this paper, we apply cAS to solving QAP. We focus our main attention on the effects of applying local search and parallelization of the cAS. Results show promising performance of cAS on QAP.
متن کاملParallel Ant Colony Optimization Algorithm on a Multi-core Processor
This paper proposes parallelization methods of ACO algorithms on a computing platform with a multi-core processor aiming at fast execution to find acceptable solutions. As an ACO algorithm, we use the cunning Ant System and test on several sizes of TSP instances. As the parallelization method, we use agent level parallelization in one colony using Java thread programming. According to the synch...
متن کاملOptimum design of fractional order PIλDμ controller for AVR system using chaotic ant swarm
Fractional-order PID (FOPID) controller is a generalization of standard PID controller using fractional calculus. Compared to PID controller, the tuning of FOPID is more complex and remains a challenge problem. This paper focuses on the design of FOPID controller using chaotic ant swarm (CAS) optimization method. The tuning of FOPID controller is formulated as a nonlinear optimization problem, ...
متن کامل